منابع مشابه
Remarks about disjoint dominating sets
We solve a number of problems posed by Hedetniemi, Hedetniemi, Laskar, Markus, and Slater concerning pairs of disjoint sets in graphs which are dominating or independent and dominating.
متن کاملOn graphs with disjoint dominating and 2-dominating sets
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only con...
متن کاملTwo remarks about analytic sets
In this paper we give two results about analytic sets. The rst is a counterexample to a problem of Fremlin. We show that there exists ! 1 compact subsets of a Borel set with the property that no -compact subset of the Borel set covers them. In the second section we prove that for any analytic subset A of the plane either A can be covered by countably many lines or A contains a perfect subset P ...
متن کاملSome remarks about Cantor sets
The classical middle-thirds Cantor set can be described as follows. Start by taking C 0 = [0, 1], the unit interval in the real line. Then put which is to say that one removes the open middle third from the unit interval to get a union of two disjoint closed intervals of length 1/3. By repeating the process one gets for each nonnegative integer j a subset C j of the unit interval which is a uni...
متن کاملTrees with two disjoint minimum independent dominating sets
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.06.017